Synchronising primitive groups of diagonal type exist
نویسندگان
چکیده
Every synchronising permutation group is primitive and of one three types: affine, almost simple, or diagonal. We exhibit the first known example a diagonal type group. More precisely, we show that PSL ( 2 , q ) × $\operatorname{{\mathrm{PSL}}}(2,q)\times \operatorname{{\mathrm{PSL}}}(2,q)$ acting in its action on $\operatorname{{\mathrm{PSL}}}(2,q)$ separating, hence synchronising, for = 13 $q=13$ 17 $q=17$ . Furthermore, such groups are non-spreading all prime powers $q$
منابع مشابه
Primitive Permutation Groups of Simple Diagonal Type
Let G be a finite primitive group such that there is only one minimal normal subgroup M in G, this M is nonabelian and nonsimple, and a maximal normal subgroup of M is regular. Further, let H be a point stabilizer in G. Then H (1 M is a (nonabelian simple) common complement in M to all the maximal normal subgroups of M, and there is a natural identification ofMwith a direct power T m of a nonab...
متن کاملGenus zero systems for primitive groups of affine type
LetMg be the moduli space of genus g curves. A Hurwitz locus inMg is a locus of points representing G-covers of fixed genus g with a given ramification type. The classification of Hurwitz loci of complex curves admitting G is by the computation of orbits of a suitable surface braid group acting on the generating tuples of G. When the genus of the curve is low, the braid orbits can be enumerated...
متن کاملCountable Primitive Groups
We give a complete characterization of countable primitive groups in several settings including linear groups, subgroups of mapping class groups, groups acting minimally on trees and convergence groups. The latter category includes as a special case Kleinian groups as well as subgroups of word hyperbolic groups. As an application we calculate the Frattini subgroup in many of these settings, oft...
متن کاملDistinguishing Primitive Permutation Groups
Let G be a permutation group acting on a set V . A partition π of V is distinguishing if the only element of G that fixes each cell of π is the identity. The distinguishing number of G is the minimum number of cells in a distinguishing partition. We prove that if G is a primitive permutation group and |V | ≥ 336, its distinguishing number is two.
متن کاملInfinite Primitive Groups.
We give a complete characterization of finitely generated primitive groups in several settings including linear groups, subgroups of mapping class groups, groups acting minimally on trees and convergence groups. The latter category includes as a special case Kleinian groups as well as finitely generated subgroups of word hyperbolic groups. As an application we calculate the Frattini subgroup in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of The London Mathematical Society
سال: 2022
ISSN: ['1469-2120', '0024-6093']
DOI: https://doi.org/10.1112/blms.12619